// Copyright (C) 2005 Taylor L. Riché <riche@cs.utexas.edu>
//  
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software 
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// 	$Id: Scheduler.cc 304 2005-10-13 02:49:55Z richetl $	
//

#include "ApplicationGraph.hh"
#include "Scheduler.hh"

using namespace lee;

ProcUnit *
Scheduler::getProcUnit(PCon * pcon)
{
  Synchronized::Scope mutex(this);
  ProcUnit * proc;
  assert(pcon->getFunction() != NULL);
  while((proc = functionMap[pcon->getFunction()->getName()]) == NULL) {
    wait();
  }
  return proc;
}

void 
Scheduler::schedule(std::list<ProcUnit *> & p, ApplicationGraph & ag)
{
  Synchronized::Scope mutex(this);
  pList = &p;
  // Simple scheduling algorithm to get things started
  std::list<ProcUnit *>::iterator j = pList->begin();
  for(std::map<std::string, Function*>::iterator i = ag.functionMap.begin();
      i != ag.functionMap.end(); i++) {
    functionMap[(*i).second->getName()] = *j;
    j++;
    if(j == pList->end()) {
      j = pList->begin();
    }
  }
  currPU = j;
  notifyAll();
  return;
}

void
Scheduler::addFunc(Function * func)
{
  Synchronized::Scope mutex(this);
  functionMap[func->getName()] = *currPU;
  currPU++;
  if(currPU == pList->end()) {
    currPU = pList->begin();
  }
  return;
}
